l0 Norm Constraint LMS Algorithm for Sparse System Identification
نویسندگان
چکیده
In order to improve the performance of Least Mean Square (LMS) based system identification of sparse systems, a new adaptive algorithm is proposed which utilizes the sparsity property of such systems. A general approximating approach on l0 norm – a typical metric of system sparsity, is proposed and integrated into the cost function of the LMS algorithm. This integration is equivalent to add a zero attractor in the iterations, by which the convergence rate of small coefficients, that dominate the sparse system, can be effectively improved. Moreover, using partial updating method, the computational complexity is reduced. The simulations demonstrate that the proposed algorithm can effectively improve the performance of LMS-based identification algorithms on sparse system.
منابع مشابه
Performance Analysis of $l_0$ Norm Constraint Least Mean Square Algorithm
As one of the recently proposed algorithms for sparse system identification, l0 norm constraint Least Mean Square (l0-LMS) algorithm modifies the cost function of the traditional method with a penalty of tap-weight sparsity. The performance of l0-LMS is quite attractive compared with its various precursors. However, there has been no detailed study of its performance. This paper presents compre...
متن کاملDiffusion L0-norm constraint improved proportionate LMS algorithm for sparse distributed estimation
To exploit the sparsity of the considered system, the diffusion proportionate-type least mean square (PtLMS) algorithms assign different gains to each tap in the convergence stage while the diffusion sparsity-constrained LMS (ScLMS) algorithms pull the components towards zeros in the steady-state stage. In this paper, by minimizing a differentiable cost function that utilizes the Riemannian dis...
متن کاملGradient optimization p-norm-like constraint LMS algorithm for sparse system estimation
In order to improve the sparsity exploitation performance of norm constraint least mean square (LMS) algorithms, a novel adaptive algorithm is proposed by introducing a variable p-norm-like constraint into the cost function of the LMS algorithm, which exerts a zero attraction to the weight updating iterations. The parameter p of the p-norm-like constraint is adjusted iteratively along the negat...
متن کاملLeast Mean Square Algorithm with Application to Improved Adaptive Sparse Channel Estimation
Least mean square (LMS) based adaptive algorithms have been attracted much attention since their low computational complexity and robust recovery capability. To exploit the channel sparsity, LMS-based adaptive sparse channel estimation methods, e.g., L1-norm LMS or zero-attracting LMS (sparse LMS or ZA-LMS), reweighted zero attracting LMS (RZA-LMS) and Lp-norm LMS (LP-LMS), have been proposed b...
متن کاملError Gradient-based Variable-Lp Norm Constraint LMS Algorithm for Sparse System Identification
Sparse adaptive filtering has gained much attention due to its wide applicability in the field of signal processing. Among the main algorithm families, sparse norm constraint adaptive filters develop rapidly in recent years. However, when applied for system identification, most priori work in sparse norm constraint adaptive filtering suffers from the difficulty of adaptability to the sparsity o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Signal Process. Lett.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009